Encoding Natural Semantics in Coq
نویسنده
چکیده
We address here the problem of automatically translating the Natural Semantics of programming languages to Coq, in order to prove formally general properties of languages. Natural Semantics 18] is a formalism for specifying semantics of programming languages inspired by Plotkin's Structural Operational Semantics 22]. The Coq proof development system 12], based on the Calculus of Constructions extended with inductive types (CCind), provides mechanized support including tactics for building goal-directed proofs. Our representation of a language in Coq is innuenced by the encoding of logics used by Church 6] and in the Edinburgh Logical Framework (ELF) 15, 3].
منابع مشابه
Proving Correctness of the Translation from Mini - ML to the CAM withthe Coq Proof Development
In this article we show how we proved correctness of the translation from a small applicative language with recursive deenitions (Mini-ML) to the Categorical abstract machine (CAM) using the Coq system. Our aim was to mechanise the proof of J. Despeyroux 10]. Like her, we use natural semantics to axiomatise the semantics of our languages. The axiomatisations of inferences systems and of the lan...
متن کاملProof Assistants for Natural Language Semantics
In this paper we discuss the use of interactive theorem provers (also called proof assistants) in the study of natural language semantics. It is shown that these provide useful platforms for NL semantics and reasoning on the one hand, and allow experiments to be performed on various frameworks and new theories, on the other. In particular, we show how to use Coq, a prominent type theory based p...
متن کاملNatural Language Inference in Coq
In this paperwe propose away to dealwith natural language inference (NLI) by implementing Modern Type Theoretical Semantics in the proof assistant Coq. The paper is a first attempt to deal with NLI and natural language reasoning in general by using the proof assistant technology. Valid NLIs are treated as theorems and as such the adequacy of our account is tested by trying to prove them. We use...
متن کاملNatural Language Reasoning Using proof-assistant technology: Rich Typing and beyond∗
In this paper, we study natural language inference based on the formal semantics in modern type theories (MTTs) and their implementations in proof-assistants such as Coq. To this end, the type theory UTT with coercive subtyping is used as the logical language in which natural language semantics is translated to, followed by the implementation of these semantics in the Coq proof-assistant. Valid...
متن کاملTheorem Proving Support in Programming Language Semantics N° ???? Theorem Proving Support in Programming Language Semantics
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verifica...
متن کامل